#!/usr/bin/python
# -*- coding: utf8 -*-
 
def quickSort(f):
	if(len(f)>1):
		pivot=f.pop()
		a=[ x for x in f if x<pivot]
		b=[ x for x in f if x>=pivot]
		return quickSort(a)+[pivot]+quickSort(b)
	else:
		return f		
		
if __name__ == "__main__":
	a=[9,3,13,9,15,0,5]
	print(a)
	print(quickSort(a))
	
